The Beehive Cellular Automaton with Memory
نویسنده
چکیده
Cellular Automata (CA) are discrete, spatially explicit extended dynamic systems. A CA system is composed of adjacent cells or sites arranged as a regular lattice, which evolves in discrete time steps. Each cell is characterized by an internal state whose value belongs to a finite set. The updating of these states is made simultaneously according to a common local transition rule involving only the neighborhood of each cell. Thus, if σ (T ) i is taken to denote the value of cell i at time step T, the site values evolve by iteration of the mapping:
منابع مشابه
Glider Dynamics in 3-Value Hexagonal Cellular Automata: The Beehive Rule
We present a 3-value cellular automaton which supports gliders, glider-guns and self-reproduction or self-destruction by glider collisions. The complex dynamics emerge spontaneously in both 2d and 3d according to the 6-neighbor, k-totalistic, “beehive” rule; the 2d dynamics on a hexagonal lattice is examined in detail. We show how analogous complex rules can be found, firstly by mutating a comp...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملThe Beehive Cluster System
In this writeup, we present the system architecture of Beehive, a cluster system we are developing at Georgia Tech for supporting interactive applications and compute-intensive servers. The system provides a shared memory programming environment on a cluster of workstations interconnected by a high speed interconnect. The principal design features of Beehive include: a global address space acro...
متن کاملCode Generation for the Beehive ISA
Developing computer architecture research platforms is difficult because it requires both the hardware platform and the software toolchain. In this paper, we describe the code-generation task of the software toolchain for the Beehive platform. Beehive is a many-core computer composed of simple 32-bit RISC connected using a token ring to a memory controller and Ethernet controller. We discuss th...
متن کاملSolving the Density Classification Task Using Cellular Automaton 184 with Memory
A type of memory based on the least mean square algorithm is explored on the density classification task, which is a well-known test problem for two-state discrete dynamical systems. In the absence of memory, there is no elementary cellular automaton that can solve this task. However, when augmented with memory, the performance of elementary cellular automaton 184 approaches that of the best-kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Cellular Automata
دوره 1 شماره
صفحات -
تاریخ انتشار 2006